A Probabilistic Active Attack on Server-Aided Secret Computation Protocols
نویسندگان
چکیده
SASC (Server-Aided Secret Computation) protocols enable a client (a smart card) to borrow computing power from a server (e.g., an untrustworthy auxiliary device like an ATM) without revealing its secret information. In this paper, we propose a new active attack on server-aided secret computation protocols. We describe our attack by using Beguin and Quisquater’s protocol. (We modify the protocol in order to immunize it against Nguyen and Stern’s lattice reduction attack.) The proposed attack reduces the search space P to
منابع مشابه
A new appraoch to server-aided secret computation
Server-Aided Secret Computation(SASC) protocol enables the client(smart card) to borrow the computing power from the server(un trusted auxiliary device like ATM) without revealing the secret information of the client. The previous approach is to decompose the client's secret information into many pieces and to reveal some of them to the server. It signiicantly accelerates the secret computation...
متن کاملActive Trial-and-error Attack on SASC Protocols
SASC (Server-Aided Secret Computation) protocols enable a client (a smart card) to borrow computing power from a server (e.g., an untrustworthy auxiliary device like an ATM) without revealing its secret information. In this paper, we propose a new active attack on server-aided secret computation protocols. We describe our attack by using Beguin and Quisquater’s protocol. (We modify the protocol...
متن کاملA New Efficient Server-Aided RSA Secret Computation Protocol against Active Attacks
In the RSA signature scheme [17], the secret computation M mod N is the most time consuming operation, where N is the product of two large prime numbers and d is the secret key. To perform this operation is hard for the device with limited computation power, so Matsumoto et al. [13] proposed the idea of server-aided secret computation protocols. In a server-aided secret computation protocol, th...
متن کاملSecurity and Performance of Server-Aided RSA Computation Protocols
This paper investigates various security issues and provides possible improvements on server-aided RSA computation schemes, mainly focused on the twephase protocols, RSA-SlM and RSA-S$M, proposed by Matsumoto et d. [4]. We first present new active attacks on these protocols when the find result is not checked. A server-aided protocol is then proposed in which the client can check the computed s...
متن کاملAttacks on Protocols for Server-Aided RSA Computation
On Crypto ’88, Matsumoto, Kato, and Imai presented protocols to speed up secret computations with insecure auxiliary devices. The two most important protocols enable a smart card to compute the secret RSA operation faster with the help of a server that is not necessarily trusted by the card holder. It was stated that if RSA is secure, the protocols could only be broken by exhaustive search in c...
متن کامل